On constacyclic codes over Z4[u]/〈u2−1〉 and their Gray images

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gray Images of Constacyclic Codes over some Polynomial Residue Rings

Let  be the quotient ring    where  is the finite field of size   and  is a positive integer. A Gray map  of length  over  is a special map from  to ( . The Gray map   is said to be a ( )-Gray map if the image of any -constacyclic code over    is a -constacyclic code over the field   . In this paper we investigate the existence of   ( )-Gray maps over . In this direction, we find an equivalent ...

متن کامل

On constacyclic codes over Z4[u]/〈u2-1〉 and their Gray images

We first define a new Gray map from R = Z4+uZ4 to Z 2 4, where u 2 = 1 and study (1 + 2u)-constacyclic codes over R. Also of interest are some properties of (1 + 2u)constacyclic codes over R. Considering their Z4 images, we prove that the Gray images of (1+2u)-constacyclic codes of length n over R are cyclic codes of length 2n over Z4. In many cases the latter codes have better parameters than ...

متن کامل

Quadratic Residue Codes over F_p+vF_p and their Gray Images

In this paper quadratic residue codes over the ring Fp + vFp are introduced in terms of their idempotent generators. The structure of these codes is studied and it is observed that these codes share similar properties with quadratic residue codes over finite fields. For the case p = 2, Euclidean and Hermitian self-dual families of codes as extended quadratic residue codes are considered and two...

متن کامل

Constacyclic Codes over $F_p+vF_p$

In this paper, we study constacyclic codes over Fp+vFp, where p is an odd prime and v = v. The polynomial generators of all constacyclic codes over Fp + vFp are characterized and their dual codes are also determined.

متن کامل

Constacyclic codes over finite fields

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length lp are characterized, where p is the characteristic of the finite field and l is a prime different from p.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2017

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2016.11.016